A Tableau Method for Graded Intersections of Modalities: A Case for Concept Languages
نویسنده
چکیده
A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checking are formulated in terms of modal logic and an algorithm for their solution is provided. An axiomatization for a restricted graded modal language with intersection of modalities (the modal counterpart of the concept language we examine) is given and used in the proposed algorithm.
منابع مشابه
Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies
We present a terminating tableau calculus for graded hybrid logic with global modalities, reflexivity, transitivity and role hierarchies. Termination of the system is achieved through pattern-based blocking. Previous approaches to related logics all rely on chain-based blocking. Besides being conceptually simple and suitable for efficient implementation, the pattern-based approach gives us a NE...
متن کاملExpTime Tableaux with Global Caching for Graded Propositional Dynamic Logic
We present the first direct tableau decision procedure for graded PDL, which uses global caching and has ExpTime (optimal) complexity when numbers are encoded in unary. It shows how to combine integer linear feasibility checking with checking fulfillment of existential star modalities for tableaux with global caching.
متن کاملTerminating Tableau Systems for Hybrid Logic with Difference and Converse
This paper contributes to the principled construction of terminating tableau systems for modal logic with nominals and difference modalities [4, 1, 8, 11]. We also consider global and converse modalities and reflexive and transitive relations. Nominals and difference enrich modal logic with equational constraints, and handling these constraints in a terminating tableau system is the main challe...
متن کاملModal logics for reasoning about infinite unions and intersections of binary relations
We consider multi-modal logic Kω (with countably infinite number of basic modalities) extended with additional modalities 〈∪〉 and 〈∩〉 corresponding to the union and intersection of all basic modalities. We present complete and sound axiomatic systems and polynomial-space terminating tableau-based decision procedures for the basic logic in this language, K∪∩ and its deterministic counterpart DK∪...
متن کاملA Framework for Graded Beliefs, Goals and Intentions
In natural language we often use graded concepts, reflecting different intensity degrees of certain features. Whenever such concepts appear in a given real-life context, they need to be appropriately expressed in its models. In this paper, we provide a framework which allows for extending the BGI model of agency by grading beliefs, goals and intentions. We concentrate on TEAMLOG [6, 7, 8, 9, 12...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Logic, Language and Information
دوره 11 شماره
صفحات -
تاریخ انتشار 2002